Resource equivalence in workflow nets
نویسندگان
چکیده
In this work we consider modeling of workflow systems with Petri nets. The problem of replacing some resources by others retaining the correct functioning of the system is studied. The relation of resource s-equivalence is defined. Some properties of this relation are studied. It is proved that s-equivalence is decidable provided the set of all minimal sound resources for a given control state is computable. For structured WF-nets with resources an algorithm checking S-equivalence is presented.
منابع مشابه
The Equivalency between Logic Petri Workflow Nets and Workflow Nets
Logic Petri nets (LPNs) can describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. Logic Petri workflow nets (LPWNs) are proposed based on LPNs in this paper. Process mining is regarded as an important bridge between modeling and analysis of data mining and business process. Workflow nets (WF-nets) are the extension to Petri nets (PNs), and have ...
متن کاملSoundness of Workflow Nets with an Unbounded Resource is Decidable
In this work we consider modeling of workflow systems with Petri nets. A resource workflow net (RWF-net) is a workflow net, supplied with an additional set of initially marked resource places. Resources can be consumed and/or produced by transitions. We do not constrain neither the intermediate nor final resource markings, hence a net can have an infinite number of different reachable states. A...
متن کاملCost Soundness for Priced Resource-Constrained Workflow Nets
We extend workflow Petri nets (wf-nets) with discrete prices, by associating a price to the execution of a transition and, more importantly, to the storage of tokens. We first define the soundness problem for priced wf-nets, that of deciding whether the workflow can always terminate properly, where in the priced setting “properly” also means that the execution does not cost more than a given th...
متن کاملModeling and Performance Analysis of Collaborative Workflow System Based on Extended Colored Stochastic Petri Nets ⋆
Based on the Extended Colored Stochastic Petri Nets (ECSPN), the workflow system was modeled and simulated. To improve described capacity of the traditional Petri nets, a model of the extended colored stochastic Petri nets is proposed, and then an instance is given to explain how to model workflow system with priority queuing and multi-instances. Through analysis of the simulation data of the m...
متن کاملSafety and Soundness for Priced Resource-Constrained Workflow Nets
We extend workflow Petri nets (wf-nets) with discrete prices, by associating a price to the execution of a transition and to the storage of tokens. We first define the safety and the soundness problems for priced wf-nets. A priced wf-net is safe if no execution costs more than a given budget. The soundness problem is that of deciding whether the workflow can always terminate properly, where in ...
متن کامل